A Blind Reversible Robust Watermarking Scheme for Relational Databases

نویسندگان

  • Chin-Chen Chang
  • Thai-Son Nguyen
  • Chia-Chen Lin
چکیده

Protecting the ownership and controlling the copies of digital data have become very important issues in Internet-based applications. Reversible watermark technology allows the distortion-free recovery of relational databases after the embedded watermark data are detected or verified. In this paper, we propose a new, blind, reversible, robust watermarking scheme that can be used to provide proof of ownership for the owner of a relational database. In the proposed scheme, a reversible data-embedding algorithm, which is referred to as "histogram shifting of adjacent pixel difference" (APD), is used to obtain reversibility. The proposed scheme can detect successfully 100% of the embedded watermark data, even if as much as 80% of the watermarked relational database is altered. Our extensive analysis and experimental results show that the proposed scheme is robust against a variety of data attacks, for example, alteration attacks, deletion attacks, mix-match attacks, and sorting attacks.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Novel Reversible Watermarking Scheme for Relational Databases Protection Based on Histogram Shifting

The watermarking technique can be used to protect the ownership of relational databases by hiding some ownership information into the relational databases. In this paper, a novel robust reversible watermarking scheme for relational database protection is proposed to increase the embedding capacity by developing an improved histogram shifting with binary tree structure and an attribute selection...

متن کامل

Robust and Reversible Relational Database Watermarking Algorithm Based on Clustering and Polar Angle Expansion

Digital watermarking has been widely applied to relational database for ownership protection and information hiding. But robustness and reversibility are two key challenges due to the frequently database maintaining operators on those tuples. This paper proposes a novel relational database watermarking scheme based on a fast and stable clustering method on database tuples, which adopts Mahalano...

متن کامل

A blind reversible method for watermarking relational databases based on a time-stamping protocol

Digital watermarking technology has been adopted lately as an effective solution to protecting the copyright of digital assets from illicit copying. Reversible watermark, which is also called invertible watermark, or erasable watermark, helps to recover back the original data after the content has been authenticated. Such reversibility is highly desired in some sensitive database applications, ...

متن کامل

RRW - A Robust and Reversible Watermarking Technique for Relational Data

Advancement in information technology is playing an increasing role in the use of information systems comprising relational databases. These databases are used effectively in collaborative environments for information extraction; consequently, they are vulnerable to security threats concerning ownership rights and data tampering. Watermarking is advocated to enforce ownership rights over shared...

متن کامل

Reversible Watermarking for Relational Database Authentication

A reversible watermarking scheme for relational databases is proposed in this paper to achieve lossless and exact authentication of relational databases via expansion on data error histogram. This reversible watermarking scheme possesses the ability of perfect restoration of the original attribute data from the untampered watermarked relational databases, thus guaranteeing a “clear and exact” t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره 2013  شماره 

صفحات  -

تاریخ انتشار 2013